Littlewood–Richardson coefficients for reflection groups

نویسندگان

  • Arkady Berenstein
  • Edward Richmond
چکیده

Article history: Received 21 June 2012 Received in revised form 7 June 2015 Accepted 23 July 2015 Available online xxxx Communicated by Roman Bezrukavnikov

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating deep Littlewood-Richardson Coefficients

Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups (GLn). The main results of this paper are: 1. A strongly polynomial randomized approximation scheme for Littlewood-Richardson coefficients corresponding to indices sufficiently far from the boundary of the Littlewood Richardson cone. 2. A proof of approximate log-concav...

متن کامل

Littlewood-Richardson coefficients and Kazhdan-Lusztig polynomials

We show that the Littlewood-Richardson coefficients are values at 1 of certain parabolic Kazhdan-Lusztig polynomials for affine symmetric groups. These q-analogues of Littlewood-Richardson multiplicities coincide with those previously introduced in [21] in terms of ribbon tableaux.

متن کامل

A max-flow algorithm for positivity of Littlewood-Richardson coefficients

Littlewood-Richardson coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL(n,C). They have a wide variety of interpretations in combinatorics, representation theory and geometry. Mulmuley and Sohoni pointed out that it is possible to decide the positivity of Littlewood-Richardson coefficients in polynomial time...

متن کامل

A polynomiality property for Littlewood-Richardson coefficients

We present a polynomiality property of the Littlewood-Richardson coefficients c λμ . The coefficients are shown to be given by polynomials in λ, μ and ν on the cones of the chamber complex of a vector partition function. We give bounds on the degree of the polynomials depending on the maximum allowed number of parts of the partitions λ, μ and ν. We first express the Littlewood-Richardson coeffi...

متن کامل

Ja n 20 05 The computation of Kostka numbers and Littlewood - Richardson coefficients is # P - complete

Kostka numbers and Littlewood-Richardson coefficients play an essential role in the representation theory of the symmetric groups and the special linear groups. There has been a significant amount of interest in their computation ([1], [10], [11], [2], [3]). The issue of their computational complexity has been a question of folklore, but was asked explicitly by E. Rassart [10]. We prove that th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015